Domain theory, testing and simulation for labelled Markov processes
نویسندگان
چکیده
منابع مشابه
Domain theory, testing and simulation for labelled Markov processes
This paper presents a fundamental study of similarity and bisimilarity for labelled Markov processes. The main results characterize similarity as a testing preorder and bisimilarity as a testing equivalence. In general, labelled Markov processes are not required to satisfy a finite-branching condition—indeed the state space may be a continuum, with the transitions given by arbitrary probability...
متن کاملBisimulation for Labelled Markov Processes
In this paper we introduce a new class of labelled transition systems Labelled Markov Processes and define bisimulation for them. Labelled Markov processes are probabilistic labelled transition systems where the state space is not necessarily discrete, it could be the reals, for example. We assume that it is a Polish space (the underlying topological space for a complete separable metric space)...
متن کاملDuality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutative C∗-algebra consisting of formal linear combinations of labelled trees. We characterize the state space of the universal LMP as the set of homomorphims from an ordered commutative monoid of labelled trees into the mult...
متن کاملLabelled Markov Processes
Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The t...
متن کاملApproximating labelled Markov processes
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.10.021